Using Classical Planners to Solve Nondeterministic Planning Problems
نویسندگان
چکیده
Researchers have developed a huge number of algorithms to solve classical planning problems. We provide a way to use these algorithms, unmodified, to generate strong-cyclic solutions in fully-observable nondeterministic planning domains. Our experiments show that when using our technique with FF and SGPlan (two well-known classical planners), its performance compares quite favorably to that of MBP, one of the best-known planners for nondeterministic planning problems.
منابع مشابه
A Translation-Based Approach to Contingent Planning
The problem of planning in the presence of sensing has been addressed in recent years as a nondeterministic search problem in belief space. In this work, we use ideas advanced recently for compiling conformant problems into classical ones for introducing a different approach where contingent problems P are mapped into non-deterministic problems X(P ) in state space. We also identify a contingen...
متن کاملStubborn Sets for Fully Observable Nondeterministic Planning
The stubborn set method is a state-space reduction technique, originally introduced in model checking and then transfered to classical planning. It was shown that stubborn sets significantly improve the performance of optimal deterministic planners by considering only a subset of applicable operators in a state. Fully observable nondeterministic planning (FOND) extends the formalism of classica...
متن کاملOn Computing Conformant Plans Using Classical Planners: A Generate-And-Complete Approach
The paper illustrates a novel approach to conformant planning using classical planners. The approach relies on two core ideas developed to deal with incomplete information in the initial situation: the use of a classical planner to solve nonclassical planning problems, and the reduction of the size of the initial belief state. Differently from previous uses of classical planners to solve non-cl...
متن کاملPlan aggregation for strong cyclic planning in nondeterministic domains
Plan aggregation for strong cyclic planning in nondeterministic domains Report Title We describe a planning algorithm, NDP2, that finds strong-cyclic solutions to nondeterministic planning problems by using a classical planner to solve a sequence of classical planning problems. NDP2 is provably correct, and fixes several problems with prior work. We also describe two preprocessing algorithms th...
متن کاملA New Approach to Conformant Planning via Classical Planners
In this paper, we introduce a new approach to conformant planning via classical planners. We view a conformant planning problem as a set of classical planning problems, called sub-problems, and solve it using a generate-and-complete algorithm. Key to this algorithm is a procedure which takes a solution of a sub-problem and generates a solution for other sub-problems. We implement this algorithm...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008